Alfred P. Sloan School of Managemen Coordinating Aggregate and Detailed Scheduling Decisions in the One Machine Job-shop: I-theory Coordinating Aggregate and Detailed Scheduling Decisions in the One Machine Job-shop: I-theory

This research presents a formal model of the one machine job shop scheduling problem with variable machine and labor capacity. Primary interest is focused on the trade-off between overtime and detailed scheduling costs. The detailed scheduling problem considered is minimizing the sum of weighted tardiness and weighted flow-time costs for a given capacity plan (e.g., a given overtime schedule). Sequence theory results are generalized to this case where possible. Various lower bounding structures for the problem are analyzed and a preliminary branch and bound algorithm is outlined. Several interesting features of the algorithm and bounding structures are illustrated by an example. Extensions of the results to more complex environments are discussed.